منابع مشابه
Anti-aliased Euclidean distance transform
We present a modified distance measure for use with distance transforms of anti-aliased, area sampled grayscale images of arbitrary binary contours. The modified measure can be used in any vector-propagation Euclidean distance transform. Our test implementation in the traditional SSED8 algorithm shows a considerable improvement in accuracy and homogeneity of the distance field compared to a tra...
متن کاملEuclidean Distance Transform Shadow Mapping
The high-quality simulation of the penumbra effect in real-time shadows is a challenging problem in shadow mapping. The existing shadow map filtering techniques are prone to aliasing and light leaking artifacts which decrease the shadow visual quality. In this paper, we aim to minimize both problems with the Euclidean distance transform shadow mapping. To reduce the perspective aliasing artifac...
متن کاملAn Efficient Euclidean Distance Transform
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computation, a commonly used approximate algorithm is the chamfer distance transform. This paper presents an efficient linear-time algorithm for calculating the true Euclidean distance-squared of each point from the nearest ...
متن کاملSkeletonization using an extended Euclidean distance transform
A standard method to perform skeletonisation is to use a distance transform. Unfortunately such an approach has the drawback that only the Symmetric axis transform can be computed and not the more practical smoothed local symmetries or the more general symmetry set. Using singularity theory we introduce an extended distance transform which may be used to capture more of the symmetries of a shap...
متن کاملA Euclidean distance transform in linear time
A new linear time scanning algorithm for the exact Euclidean distance transform is presented. It is shorter and uses a smaller data structure than the approximating algorithms of Danielsson. The algorithm consists of two phases. The rst phase uses two scans per line to compute the distance transform over the columns of the image. Then the second phase uses two scans per row. Informally speaking...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2011
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2010.08.010